The M-Relative Reduct Problem
نویسندگان
چکیده
Since there may exist many relative reducts for a decision table, some attributes that are very important from the viewpoint of human experts may fail to be included in relative reduct(s) computed by certain reduction algorithms. In this paper we present the concepts of M-relative reduct and core where M is a user specified attribute set to deal with this problem. M-relative reducts and cores can be obtained using M -discernibility matrices and functions. Their relationships with traditional definitions of relative reduct and core are closely investigated.
منابع مشابه
Attribute Reduction using Forward Selection and Relative Reduct Algorithm
Attribute reduction of an information system is a key problem in rough set theory and its applications. Rough set theory has been one of the most successful methods used for feature selection. Rough set is one of the most useful data mining techniques. This paper proposes relative reduct to solve the attribute reduction problem in roughest theory. It is the most promising technique in the Rough...
متن کاملAn Evaluation Method of Relative Reducts Based on Roughness of Partitions
This paper focuses on rough set theory which provides mathematical foundations of set-theoretical approximation for concepts, as well as reasoning about data. Also presented in this paper is the concept of relative reducts which is one of the most important notions for rule generation based on rough set theory. In this paper, from the viewpoint of approximation, the authors introduce an evaluat...
متن کاملA Heuristic Optimal Reduct Algorithm
Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining, In this paper, we propose a heuristic reduct finding algorithm, which is based on frequencies of attributes appeared in discernibility matrix. Our method does not guarantee to find optimal reduct, but experiment shows that in most situations it doe...
متن کاملFuzzy rough set based incremental attribute reduction from dynamic data with sample arriving
Attribute reduction with fuzzy rough set is an effective technique for selecting most informative attributes from a given realvalued dataset. However, existing algorithms for attribute reduction with fuzzy rough set have to re-compute a reduct from dynamic data with sample arriving where one sample or multiple samples arrive successively. This is clearly uneconomical from a computational point ...
متن کاملAn Efficient Global Optimization Approach for Rough Set Based Dimensionality Reduction
The theory of rough set, proposed by Pawlak, provides a formal tool for knowledge discovery from imprecise and incomplete data. Dimensionality reduction (RED) is a crucial problem for rough set based data mining. Unfortunately, it proves to be a NP-hard problem. Many reduction algorithms based on heuristic information have been developed, but they are all based on Boolean space {0,1}m. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006